Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
891	Two Improved Range-Eﬃcient Algorithms for F0 Estimation He Sun1,2 and Chung Keung Poon1 1 2 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2007-04-12 14:13:22 Analysis of algorithms Computational complexity theory Time complexity Logarithm Big O notation Streaming algorithm Factorization of polynomials over a finite field and irreducibility tests Euclidean algorithm Theoretical computer science Mathematics Applied mathematics
892	The Ackermann Award 2008 J.A. Makowsky and D. Niwinski Members of EACSL Jury for the Ackermann Award! The fourth Ackermann Award is presented at this CSL’08. This is the second year in which the EACSL Ackermann Award i Add to Reading List Source URL: eacsl.kahle.ch Language: English - Date: 2013-12-08 17:58:05 Game theory Determinacy Logic in computer science Parity game Wilhelm Ackermann Ackermann function IEEE Symposium on Logic in Computer Science Computational complexity theory Stochastic Mathematics Mathematical logic Theoretical computer science
893	Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies arXiv:1201.2715v2 [cs.DM] 9 AprThomas Sauerwald Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2012-04-11 04:09:05 Combinatorial optimization Matching Graph coloring Symbol Partial differential equation Connectivity Spectral theory of ordinary differential equations Dirac delta function Mathematics Theoretical computer science Computational complexity theory
894	QIP 2001 Fourth Workshop on Quantum Information Processing Amsterdam, January 9-12, 2001 Add to Reading List Source URL: homepages.cwi.nl Language: English - Date: 2000-09-05 10:02:14 Quantum cryptography Computational complexity theory Centrum Wiskunde & Informatica Quantum computer Quantum information science IP Royal Netherlands Academy of Arts and Sciences Theoretical computer science Applied mathematics QIP
895	Donati et al. Algorithms for Molecular Biology:3 DOIs13015SOFTWARE ARTICLE Open Access Add to Reading List Source URL: www.almob.org Language: English Operations research Mathematics Search algorithms Computational complexity theory Dynamic programming Optimal control Optimization problem Reduction Genetic algorithm Theoretical computer science Applied mathematics Mathematical optimization
896	13th International Workshop on Termination (WSTJohannes Waldmann (Editor) WST 2013, August 29–31, 2013, Bertinoro, Italy Preface Add to Reading List Source URL: www.imn.htwk-leipzig.de Language: English - Date: 2013-08-27 10:27:44 Primitive recursive function Mathematics Computational complexity theory Valuation
897	Édouard Bonnet Paris Dauphine - LAMSADE Computer Science Department Place du Maréchal de Lattre de TassignyParis Add to Reading List Source URL: www.lamsade.dauphine.fr Language: English - Date: 2015-04-20 04:47:40 Parameterized complexity Time complexity Approximation algorithm Vangelis Complexity Set cover problem Cut Theoretical computer science Computational complexity theory Applied mathematics
898	Budget Feasible Mechanisms for Experimental Design Thibaut Horel ´ Ecole Normale Sup´erieure Add to Reading List Source URL: thibaut.horel.org Language: English - Date: 2015-01-22 00:44:30 Approximation algorithms Submodular set function Time complexity Linear programming relaxation Polynomial-time approximation scheme Linear programming Randomized rounding Normal distribution Linear regression Theoretical computer science Applied mathematics Computational complexity theory
899	The Ackermann Award 2009 J.A. Makowsky and A. Razborov Members of EACSL Jury for the Ackermann Award The ﬁfth Ackermann Award is presented at this CSL’09, held in Coimbra, Portugal. This is the third year in which th Add to Reading List Source URL: eacsl.kahle.ch Language: English - Date: 2013-12-08 17:58:05 Logic Wilhelm Ackermann Alexander Razborov Proof complexity DPLL algorithm Resolution Computational complexity theory Ackermann function Propositional proof system Theoretical computer science Mathematics Automated theorem proving
900	A new exponential separation between quantum and classical one-way communication complexity Ashley Montanaro∗ April 26, 2011 Abstract Add to Reading List Source URL: www.damtp.cam.ac.uk Language: English - Date: 2011-04-26 10:51:57 Computational complexity theory Quantum information science Communication Communication complexity PP NP One-Shot Entanglement-Enhanced Classical Communication Decision tree model Theoretical computer science Applied mathematics Quantum complexity theory

UPDATE